Three complexity functions
نویسندگان
چکیده
منابع مشابه
Three complexity functions
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes. Primary 37B10; Secondary 68R15 1 Preliminaries Given a language L on a finite alphabet A, the com...
متن کاملComplexity Preserving Functions
It’s widely recognized that compression is useful and even necessary for inductive learning, where a short description will capture the ‘regularities’. We introduce complexitypreserving functions that preserve these regularities of the concept. They are based on the universal information distance [Bennett et al. ‘97] and define for an instance a set of elements sharing the same complexity type....
متن کاملComputational Complexity of Functions
Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression, Speed-up, etc.) was done in [Tseitin 56, Rabin 59, Hartmanis Stearns 65, Blum 67, Trakhtenbrot 67, Meyer Fischer 72]. I translated only the part with the state...
متن کاملComplexity-Restricted Advice Functions
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions desc...
متن کاملComplexity of Regular Functions
We give complexity bounds for various classes of functions computed by cost register automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2011
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011126